The factorial representation of balanced labelled graphs
نویسندگان
چکیده
منابع مشابه
Remarks on Distance-Balanced Graphs
Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.
متن کاملDistance-Balanced Closure of Some Graphs
In this paper we prove that any distance-balanced graph $G$ with $Delta(G)geq |V(G)|-3$ is regular. Also we define notion of distance-balanced closure of a graph and we find distance-balanced closures of trees $T$ with $Delta(T)geq |V(T)|-3$.
متن کاملSuccinct Representation of Balanced Parentheses, Static Trees and Planar Graphs
We consider the implementation of abstract data types for the static objects: binary tree, rooted ordered tree and balanced parenthesis expression. Our representations use an amount of space within a lower order term of the information theoretic minimum and support, in constant time, a richer set of navigational operations than has previously been considered in similar work. In the case of bina...
متن کاملheterogeneity within the orientalist discourse: representation of the orient in womens travelogues and mens paintings
from 1950s onward, new theories and critical approaches burgeoned across humanities. these theories were context-oriented; as a result, the analysis of discursive practices gained significance. thus, social, political, historical and cultural discourses that have been hitherto marginalized and considered inferior to literary texts, were introduced as important texts to be analyzed by critics. o...
Factorial properties of graphs
We explore an operation on graphs that is analogous to the factorial of a positive integer. We develop formulas for the factorials of complete graphs, odd cycles and complete bipartite graphs, and we prove some properties of the factorial operation. We conclude with a list of open questions. This paper explores some properties of a factorial operation that associates to each graph G a graph G! ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1976
ISSN: 0012-365X
DOI: 10.1016/0012-365x(76)90051-0